The GI/M/1 Queue with Exponential Vacations
نویسندگان
چکیده
We consider the busy period in the GI/M/1 queue with multiple exponential vacations. We derive the transform of the joint distribution of the length of a busy period, the number of customers served during the busy period, and the residual interarrival time at the instant the busy period ends.
منابع مشابه
An Absorbing Markov Chain Approach to GI/M/1 Queues with Generalized Vacations
1 Q I − − ) ( y , where the j th entry of the row vector y is the probability that the system state seen by the first arrival during a busy period is j and 1 Q I − − ) ( is the fundamental matrix associated with the standard GI/M/1 queue. In this paper, we present the entries of 1 Q I − − ) ( explicitly. Also, we illustrate how to find y by examples such as the N -policy GI/M/1 queue with or wi...
متن کاملDecomposition results - the true story
In this note we identify a simple setup from which one may easily infer various decomposition results for queues with interruptions as well as càdlàg processes with certain secondary jump inputs. In particular, this can be done for processes with stationary or stationary and independent increments. It resulted from an attempt to understand these kind of results after having detected an error in...
متن کاملOn the Waiting Time in the GI/M/1 Vacations Queues with Dependency Between Interarrival and Service Times
We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.
متن کاملThe BMAP/GI/l Queue with Server Set-UpTimes and Server Vacations
PALM-MARTINGALE CALCULUS, QUEUES WITH VACATIONS, BATCH MARKOVIAN ARRIVAL PROCESSES,SERVER SET-UP Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP IGl/1 . queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a custo...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 5 شماره
صفحات -
تاریخ انتشار 1989